Cellular networks planning: A workload balancing perspective

نویسندگان

  • Chen Ran
  • Shaowei Wang
  • Chonggang Wang
چکیده

Cell planning has been a long-standing problem since the very starting commercialization of mobile communications, ofwhich power coverage and capacity coverage are twomajor objectives. In this paper, we develop a novel cell planning scheme that is effective and efficient for both the conventional cellular systems and the arising heterogeneous networks, e.g., the long term evolution advanced (LTE-A) one. The key idea of our proposal is that we redesign the service regionsof base stations (BSs) in a traffic-balancedway,makingeachBS serve a subregionof ALMOSTequal throughput requirement. For agivenconnectedpolygonal region tobe servedby a cellular system,we first divide it into compact and connected subregions based on an infinite optimization formulation while keeping the traffic demands of all subregions as equal as possible. Each subregionwill be served by a BS located in it. To avoid yielding ill-shaped subregion that isdifficult tobecoveredbyapractical BS, apenalty term is introduced to theobjective function and it is required that areas of subregions should not differ toomuch fromeachother. Then we select the BS from all candidate sites in each subregion to minimize the total power consumption. By using the proposed dividing and selecting algorithms,we update the boundary of each subregion and the location of each BS in an iterative manner until convergence. Numerical results show that our proposal performs quite well for both randomly generated scenarios and real city environment. The proposed cell planning method provides quality of service (QoS) guaranteed performance with lower capital expenditure and operating expenditure. © 2015 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Comprehensive Mathematical Model for the Design of a Dynamic Cellular Manufacturing System Integrated with Production Planning and Several Manufacturing Attributes

    Dynamic cellular manufacturing systems,   Mixed-integer non-linear programming,   Production planning, Manufacturing attributes   This paper presents a novel mixed-integer non-linear programming model for the design of a dynamic cellular manufacturing system (DCMS) based on production planning (PP) decisions and several manufacturing attributes. Such an integrated DCMS model with an extensi...

متن کامل

The Impact of Workload Variability on Load Balancing Algorithms

The workload on a cluster system can be highly variable, increasing the difficulty of balancing the load across its nodes. The general rule is that high variability leads to wrong load balancing decisions taken with out-of-date information and difficult to correct in real-time during applications execution. In this work the workload variability is studied from the perspective of the load balanc...

متن کامل

Optimal Load Balancing in Publish/Subscribe Broker Networks

Load balancing in publish/subscribe (pub/sub) broker networks is challenging as the workload is multi-dimensional and content-dependent. In this paper we present the framework design of a middleware , called Shuffle, to achieve optimal load balancing in a pub/sub broker network. Shuffle features a suite of active workload management schemes within a single overlay topology on message parsing, m...

متن کامل

Iterative Dynamic Load Balancing in Multicomputers

Dynamic load balancing in multicomputers can improve the utilization of processors and the eeciency of parallel computations through migrating workload across processors at runtime. We present a survey and critique of dynamic load balancing strategies that are iterative: workload migration is carried out through transferring processes across nearest neighbor processors. Iterative strategies hav...

متن کامل

A Study on DynamicLoad Balancing

Dynamic load balancing techniques have proved to be the most critical part of an eecient implementation of various algorithms on large distributed computing systems. In this paper a classification of dynamic distributed load balancing algorithms for homogeneous multiprocessor systems is introduced and a general test bed, using a random branch & bound load-generator, for evaluating load balancin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Networks

دوره 84  شماره 

صفحات  -

تاریخ انتشار 2015